Polygonal Simplification: An Overview
نویسنده
چکیده
منابع مشابه
A Hierarchy of Techniques for Simplifying Polygonal Models
It is evident from these course notes and their references that there is a tremendous interest in the general area of simplification of polygonal objects. There are several ways in which one can classify the various simplification techniques. One of these is by examining the nature of the performed simplifications. This section of the course will overview some representative techniques from a h...
متن کاملMultiresolution Modeling: Survey & Future Opportunities
For twenty years, it has been clear that many datasets are excessively complex for applications such as real-time display, and that techniques for controlling the level of detail of models are crucial. More recently, there has been considerable interest in techniques for the automatic simplification of highly detailed polygonal models into faithful approximations using fewer polygons. Several e...
متن کاملA Survey of Polygonal Simplification Algorithms UNC Technical Report TR97-045
Polygonal simplification is at once a very current and a very old topic in computer graphics. As early as 1976 James Clark described the benefits of representing objects within a scene at several resolutions, and flight simulators have long used handcrafted multi-resolution models of airplanes to guarantee a constant frame rate [Clark 76, Cosman 81]. Recent years have seen a flurry of research ...
متن کاملA Survey of Polygonal Simplification Algorithms
Polygonal simplification is at once a very current and a very old topic in computer graphics. As early as 1976 James Clark described the benefits of representing objects within a scene at several resolutions, and flight simulators have long used hand-crafted multi-resolution models of airplanes to guarantee a constant frame rate [Clark 76, Cosman 81]. Recent years have seen a flurry of research...
متن کاملPolygonal Chain Simplification with Small Angle Constraints
We consider the problem of simplifying an n-vertex polygonal chain with small angle constraints in R and R, thus closing the gap on the range of angles left in previous work on the problem. Specifically, we show that the min-# version of the polygonal chain simplification problem with small angle constraints can be solved in O(n) time and space in R, and in O(n log n) time, O(n) space in R.
متن کامل